Group-by and Aggregate Functions in XML Keyword Search
نویسندگان
چکیده
In this paper, we study how to support group-by and aggregate functions in XML keyword search. It goes beyond the simple keyword query, and raises several challenges including: (1) how to address the keyword ambiguity problem when interpreting a keyword query; (2) how to identify duplicated objects and relationships in order to guarantee the correctness of the results of aggregation functions; and (3) how to compute a keyword query with group-by and aggregate functions. We propose an approach to address the above challenges. As a result, our approach enables users to explore the data as much as possible with simple keyword queries. The experimental results on real datasets demonstrate that our approach can support keyword queries with group-by and aggregate functions which are not addressed by the LCA-based approaches while achieving a similar response time to that of LCA-based approaches.
منابع مشابه
XML based Keyword Search
The success of information retrieval style keyword search on the web leads to the emergence of XML based keyword search. The text database and XML database differences leads to three new challenges: 1) The users search intention is to be identified, i. e. , the XML node types that user wants to search for and search via is identified. 2) The similarities in tag name, tag value and the structure...
متن کاملJoin-Based Algorithms for Keyword Search in XML Databases
We consider the problem of keyword search in XML databases under the excluding lowest common ancestor (ELCA) semantics. Our analysis shows that ELCA semantics may lead to conflict with keyword proximity concept, and under such semantics, lower ELCAs are preferable because lower elements tend to be more specific. However, existing algorithms (stack-based and index-based) do not provide efficient...
متن کاملExploiting ID References for Effective Keyword Search in XML Documents
In this paper, we study novel Tree + IDREF data model for keyword search in XML. In this model, we propose novel Lowest Referred Ancestor (LRA) pair, Extended LRA (ELRA) pair and ELRA group semantics for effective and efficient keyword search. We develop efficient algorithms to compute the search results based on our semantics. Experimental study shows the superiority of our approach.
متن کاملPowerQ: An Interactive Keyword Search Engine for Aggregate Queries on Relational Databases
Keyword search over relational databases has gained popularity due to its ease of use. Current research has focused on the efficient computation of results from multiple tuples, and largely ignores queries to retrieve statistical information from databases. The work in [5] developed a system that allows aggregate functions to be expressed using simple keywords. However, this system may return i...
متن کاملProcessing XML Keyword Search by Constructing Effective Structured Queries
Recently, keyword search has attracted a great deal of attention in XML database. It is hard to directly improve the relevancy of XML keyword search because lots of keyword-matched nodes may not contribute to the results. To address this challenge, in this paper we design an adaptive XML keyword search approach, called XBridge, that can derive the semantics of a keyword query and generate a set...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014